Graph coloring

Results: 948



#Item
51A Linear-Time Algorithm for Network Decomposition Lenore J. Cowen Department of Mathematical Sciences The Johns Hopkins University Baltimore, MD 21218 

A Linear-Time Algorithm for Network Decomposition Lenore J. Cowen Department of Mathematical Sciences The Johns Hopkins University Baltimore, MD 21218 

Add to Reading List

Source URL: www.cs.tufts.edu

Language: English - Date: 2012-10-31 09:54:23
52Discrete Mathematics – 43 www.elsevier.com/locate/disc Identifying phylogenetic trees Magnus Bordewicha , Katharina T. Huberb , Charles Semplec a School of Computing, University of Leeds, Leeds LS2 9JT, U

Discrete Mathematics – 43 www.elsevier.com/locate/disc Identifying phylogenetic trees Magnus Bordewicha , Katharina T. Huberb , Charles Semplec a School of Computing, University of Leeds, Leeds LS2 9JT, U

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2006-01-18 08:08:22
53QCSP on partially reflexive forests Barnaby Martin? School of Engineering and Computing Sciences, Durham University Science Labs, South Road, Durham, DH1 3LE, UK

QCSP on partially reflexive forests Barnaby Martin? School of Engineering and Computing Sciences, Durham University Science Labs, South Road, Durham, DH1 3LE, UK

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2011-04-01 20:03:12
54entropymethodV11-SODA-cameraready.dvi

entropymethodV11-SODA-cameraready.dvi

Add to Reading List

Source URL: www.math.washington.edu

Language: English - Date: 2013-11-01 17:11:52
55

PDF Document

Add to Reading List

Source URL: www-cc.cs.uni-saarland.de

Language: English - Date: 2014-05-22 04:06:43
56New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ † Archontia C. Giannopoulou‡ §

New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ † Archontia C. Giannopoulou‡ §

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2016-05-11 15:56:58
57METRICALLY HOMOGENEOUS GRAPHS OF DIAMETER THREE DANIELA AMATO, GREGORY CHERLIN, AND H. DUGALD MACPHERSON Abstract. We classify countable metrically homogeneous graphs of diameter 3.

METRICALLY HOMOGENEOUS GRAPHS OF DIAMETER THREE DANIELA AMATO, GREGORY CHERLIN, AND H. DUGALD MACPHERSON Abstract. We classify countable metrically homogeneous graphs of diameter 3.

Add to Reading List

Source URL: www1.maths.leeds.ac.uk

Language: English - Date: 2016-06-30 08:12:01
583-coloring triangle-free planar graphs with a precolored 8-cycle Zdenˇek Dvoˇra´k ∗

3-coloring triangle-free planar graphs with a precolored 8-cycle Zdenˇek Dvoˇra´k ∗

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:45:15
59PATHS, TREES, AND FLOWERS JACK E D M O N D S 1. Introduction. A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertic

PATHS, TREES, AND FLOWERS JACK E D M O N D S 1. Introduction. A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertic

Add to Reading List

Source URL: www.cs.mun.ca

Language: English - Date: 2015-03-23 10:06:06
60The giant component in a random subgraph of a given graph Fan Chung1 ? , Paul Horn1 , and Linyuan Lu2 1 ??

The giant component in a random subgraph of a given graph Fan Chung1 ? , Paul Horn1 , and Linyuan Lu2 1 ??

Add to Reading List

Source URL: web.cs.du.edu

Language: English - Date: 2010-11-16 11:14:05